Observational proofs by rewriting

Observational proofs by rewriting

Separation Logic Adapted for Proofs by Rewriting

We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in off-the-shelf theorem provers. This proof automation is sufficiently strong to free the user from dealing with low-level details in proofs of functional correctness. The work presented here has been implemented in HOL...

Observational Proofs by Implicit Context Induction

Observability concepts contribute to a better understanding of software correct-ness. In order to prove observational properties, the powerful concept of Context Induction has been developed by Hennicker Hen91]. We propose in this paper to embed Context Induction in the implicit induction framework of BR95]. The proof system we obtain applies to conditional speciications. It allows for many rew...

Observational Proofs with Critical Contexts

Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the concept of Context Induction has been developed by Hennicker 10]. We propose in this paper to embed Context Induction in the implicit induction framework of 8]. The proof system we obtain applies to conditional speciications. It allows for many rewriting technique...

Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting

We propose a term rewriting approach to verify observational congruence between guarded recursive (finite-state) CCS expressions. Starting from the complete axiomatization of observational congruence for this subset of CCS, a non-terminating rewriting relation has been defined. This rewriting relation is co-canonical over a subclass of infinite derivations, structured fair derivations, which co...